Reduction maps and minimal model theory

using game theory techniques in self-organizing maps training

شبکه خود سازمانده پرکاربردترین شبکه عصبی برای انجام خوشه بندی و کوانتیزه نمودن برداری است. از زمان معرفی این شبکه تاکنون، از این روش در مسائل مختلف در حوزه های گوناگون استفاده و توسعه ها و بهبودهای متعددی برای آن ارائه شده است. شبکه خودسازمانده از تعدادی سلول برای تخمین تابع توزیع الگوهای ورودی در فضای چندبعدی استفاده می کند. احتمال وجود سلول مرده مشکلی اساسی در الگوریتم شبکه خودسازمانده به حسا...

Conformal Maps and Minimal Surfaces

Model Reduction in Kinetic Theory

Methods to derive macroscopic transport equations for rarefied gases from the Boltzmann equations are presented. Featured methods include the Chapman-Enskog expansion, Grad’s moment method, and the author’s order of magnitude method. The resulting macroscopic equations are compared and discussed by means of simple problems, including linear stability, shock wave structures, and Couette flow.

A Minimal Model for Set Theory

In the proof of the consistency of the Continuum Hypothesis and the Axiom of Choice with the other axioms of set theory, Gödel [ l ] introduced the notion of a constructible set and showed that the constructible sets form a model for set theory. These sets are intuitively those which can be reached by means of a transfinite sequence of several simple operations. He then showed that the Axiom of...

Coarse graining and control theory model reduction

We explain a method, inspired by control theory model reduction and interpolation theory, that rigorously establishes the types of coarse graining that are appropriate for systems with quadratic, generalized Hamiltonians. For such systems, general conditions are given that establish when local coarse grainings should be valid. Interestingly, our analysis provides a reduction method that is vali...